Nonhomogeneous Parking Functions and Noncrossing Partitions
نویسندگان
چکیده
For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov [9]. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are given in terms of the (reduced) type of k-divisible noncrossing partitions. Our work extends Haiman’s notion of a parking function symmetric function [5, 10].
منابع مشابه
Parking Functions of Types A and B
The lattice of noncrossing partitions can be embedded into the Cayley graph of the symmetric group. This allows us to rederive connections between noncrossing partitions and parking functions. We use an analogous embedding for type B noncrossing partitions in order to answer a question raised by R. Stanley on the edge labeling of the type B non-crossing partitions lattice.
متن کاملParking functions and noncrossing partitions
A parking function is a sequence (a 1 ; : : : ; a n ) of positive integers such that if b 1 b 2 b n is the increasing rearrangement of a 1 ; : : : ; a n , then b i i. A noncrossing partition of the set [n] = f1; 2; : : : ; ng is a partition of the set [n] with the property that if a < b < c < d and some block B of contains both a and c, while some block B 0 of contains both b and d, then B = B ...
متن کاملCyclic Sieving and Rational Catalan Theory
Let a < b be coprime positive integers. Armstrong, Rhoades, and Williams (2013) defined a set NC(a, b) of ‘rational noncrossing partitions’, which form a subset of the ordinary noncrossing partitions of {1, 2, . . . , b− 1}. Confirming a conjecture of Armstrong et. al., we prove that NC(a, b) is closed under rotation and prove an instance of the cyclic sieving phenomenon for this rotational act...
متن کاملEnumeration of connected Catalan objects by type
Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects which carry a notion of type. There exists a product formula which enumerates these objects according to type. We define a notion of ‘connectivity’ for these objects and prove an analogous product formula which counts connected objects by type. Our proof of this product ...
متن کاملUndesired Parking Spaces and Contractible Pieces of the Noncrossing Partition Link
There are two natural simplicial complexes associated to the noncrossing partition lattice: the order complex of the full lattice and the order complex of the lattice with its bounding elements removed. The latter is a complex that we call the noncrossing partition link because it is the link of an edge in the former. The first author and his coauthors conjectured that various collections of si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008